Linear operators that preserve Boolean rank of Boolean matrices
نویسندگان
چکیده
منابع مشابه
Complexity of Linear Boolean Operators Complexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملLinear Operators That Preserve Graphical Properties of Matrices: Isolation Numbers
Let A be a Boolean {0, 1} matrix. The isolation number of A is the maximum number of ones in A such that no two are in any row or any column (that is they are independent), and no two are in a 2 × 2 submatrix of all ones. The isolation number of A is a lower bound on the Boolean rank of A. A linear operator on the set of m× n Boolean matrices is a mapping which is additive and maps the zero mat...
متن کاملLinear operators that strongly preserve graphical properties of matrices - II
Beasley, L.B. and N.J. Pullman, Linear operators that strongly preserve graphical properties of matrices, Discrete Mathematics 104 (1992) 143-157. An operator on the set Ju of n X n matrices strongly preserves a subset 9 if it maps 9 into 9 and A\% into A\%. The operator semigroup of 9 is the semigroup of linear operators strongly preserving 9. We show that all the n x n matrix-families which a...
متن کاملComplexity of Linear Boolean Operators
How to compute a linear Boolean operator by a small circuit using only unbounded fanin addition gates? Because this question is about one of the simplest and most basic circuit models, it has been considered by many authors since the early 1950s. This has led to a variety of upper and lower bound arguments—ranging from algebraic (determinant and matrix rigidity), to combinatorial (Ramsey proper...
متن کاملLinear operators that strongly preserve regularity of fuzzy matrices
An n× n fuzzy matrix A is called regular if there is an n× n fuzzy matrix G such that AGA = A. We study the problem of characterizing those linear operators T on the fuzzy matrices such that T (X) is regular if and only if X is. Consequently, we obtain that T strongly preserves regularity of fuzzy matrices if and only if there are permutation matrices P and Q such that it has the form T (X) = P...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 2013
ISSN: 0011-4642,1572-9141
DOI: 10.1007/s10587-013-0027-z